Brazilian Symposium on Graphs, Algorithms and CombinatoricsREED, Bruce A; SONG, Siang W; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2004, Vol 141, Num 1-3, issn 0166-218X, 297 p.Conference Proceedings

Combinatorial algorithms for design of DNA arraysHANNENHALLI, Sridhar; HUBBELL, Earl; LIPSHUTZ, Robert et al.Advances in biochemical engineering, biotechnology. 2002, Vol 77, pp 1-19, issn 0724-6145, 19 p.Article

Packing non-returning A-paths algorithmicallyPAP, Gyula.Discrete mathematics. 2008, Vol 308, Num 8, pp 1472-1488, issn 0012-365X, 17 p.Conference Paper

Fast algorithms for computing jones polynomials of certain linksMURAKAMIA, M; HARA, M; YAMAMOTO, M et al.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 1-24, issn 0304-3975, 24 p.Article

Fractional packing of T-joinsBARAHONA, Francisco.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 4, pp 661-669, issn 0895-4801, 9 p.Article

Gray code for derangementsBARIL, Jean-Luc; VAJNOVSZKI, Vincent.Discrete applied mathematics. 2004, Vol 140, Num 1-3, pp 207-221, issn 0166-218X, 15 p.Article

Boolean and Pseudo-Boolean FunctionsHAMMER, Peter L.Discrete applied mathematics. 2004, Vol 142, Num 1-3, issn 0166-218X, 210 p.Serial Issue

Phorma: perfectly hashable order restricted multidimensional arraysLINS, Lauro; LINS, Sostenes; MELO, Silvio et al.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 209-223, issn 0166-218X, 15 p.Conference Paper

Improved combinatorial group testing algorithms for real-world problem suzesEPPSTEIN, David; GOODRICH, Michael T; HIRSCHBERG, Daniel S et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1360-1375, issn 0097-5397, 16 p.Article

The average connectivity of a digraphHENNING, Michael A; OELLENNANN, Ortrud R.Discrete applied mathematics. 2004, Vol 140, Num 1-3, pp 143-153, issn 0166-218X, 11 p.Article

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional gridMORGANA, Aurora; DE MELLO, Célia Picinin; SONTACCHI, Giovanna et al.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 225-241, issn 0166-218X, 17 p.Conference Paper

Distances and diameters on iterated clique graphsPIZANA, Miguel A.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 255-261, issn 0166-218X, 7 p.Conference Paper

INTEGER EXACT NETWORK SYNTHESIS PROBLEMKABADI, S. N; YAN, J; DU, D et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 136-154, issn 0895-4801, 19 p.Article

Integer version of the multipath flow network synthesis problemKABADI, S. N; CHANDRASEKARAN, R; NAIR, K. P. K et al.Discrete applied mathematics. 2008, Vol 156, Num 18, pp 3376-3399, issn 0166-218X, 24 p.Article

Review of combinatorial problems induced by spatial forest harvesting planningWEINTRAUB, Andres; MURRAY, Alan T.Discrete applied mathematics. 2006, Vol 154, Num 5, pp 867-879, issn 0166-218X, 13 p.Conference Paper

Combinatorial algorithms for the minimum interval cost flow problemMEHDI HASHEMI, S; GHATEE, Mehdi; NASRABADI, Ebrahim et al.Applied mathematics and computation. 2006, Vol 175, Num 2, pp 1200-1216, issn 0096-3003, 17 p.Article

Faster query algorithms for the text fingerprinting problemCHAN, Chi-Yuan; YU, Hung-I; HON, Wing-Kai et al.Information and computation (Print). 2011, Vol 209, Num 7, pp 1057-1069, issn 0890-5401, 13 p.Article

The external constraint 4 nonempty part sandwich problemTEIXEIRA, Rafael B; DANTAS, Simone; DE FIGUEIREDO, Celina M. H et al.Discrete applied mathematics. 2011, Vol 159, Num 7, pp 661-673, issn 0166-218X, 13 p.Article

FASTER AND SIMPLER ALGORITHMS FOR MULTICOMMODITY FLOW AND OTHER FRACTIONAL PACKING PROBLEMSGARG, Naveen; KÖNEMANN, Jochen.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 630-652, issn 0097-5397, 23 p.Article

Exact enumeration of rooted 3-connected triangular maps on the projective planeZHICHENG GAO; JIANYU WANG.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 149-159, issn 0166-218X, 11 p.Conference Paper

Bounds for optimal coveringsMOREIRA, Carlos Gustavo T. De A; KOHAYAKAWA, Yoshiharu.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 263-276, issn 0166-218X, 14 p.Conference Paper

Approximate swapped matchingAMIR, Amihood; LEWENSTEIN, Moshe; PORAT, Ely et al.Information processing letters. 2002, Vol 83, Num 1, pp 33-39, issn 0020-0190Article

Element perturbation problems of optimum spanning trees with two-parameter objectivesYUNG-CHENG CHANG; LIH-HSING HSU.Information processing letters. 1995, Vol 53, Num 1, pp 55-59, issn 0020-0190Article

A combinatorial approximation algorithm for concurrent flow problem and its applicationCHIOU, Suh-Wen.Computers & operations research. 2005, Vol 32, Num 4, pp 1007-1035, issn 0305-0548, 29 p.Article

On the construction of most reliable networksHANYUAN DENG; JIANER CHEN; QIAOLIANG LI et al.Discrete applied mathematics. 2004, Vol 140, Num 1-3, pp 19-33, issn 0166-218X, 15 p.Article